// Problem: 
// Contest: 
// URL: 
// Memory Limit: 
// Time Limit: 
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include<bits/stdc++.h>
using namespace std;
#define int long long
inline int read(){
	int s=0,w=1;
	char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}
	while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
	return s*w;
}
signed main()
{
	int n,q;
	scanf("%lld %lld",&n,&q);
	//vector<int> a((n+1)*1e6);
	unordered_map<int,int>a;
	int x,i,j,k;
	for(int m=0;m<q;m++)
	{
		scanf("%lld",&x);
		if(x==1)
		{
			scanf("%lld %lld %lld",&i,&j,&k);
			a[i*1000000+j]=k;
		}
		else if(x==2)
		{
			scanf("%lld %lld",&i,&j);
			printf("%lld\n",a[i*1000000+j]);
		}
	}
	return 0;
}
